Methods and systems for deriving seed position of a subscriber station in support of unassisted gps-type position determination in a wireless communication system

ABSTRACT

In a method and system for deriving a seed position of a subscriber station in a wireless communications system in supporting unassisted GPS-type position determination is provided, the subscriber station receives overhead messages from the wireless communications system, and derives the seed position from the parameter values. The subscriber station may use a data structure in its memory and map possible parameter values to corresponding positions that may serve as the seed positions.

RELATED APPLICATIONS

This application is a divisional of U.S. patent application Ser. No. 11/244,529, filed Oct. 5, 2005, entitled “Methods and systems for deriving seed position of a subscriber station in support of unassisted GPS-type position determination in a wireless communication system”, which claims the benefit of and priority to U.S. Provisional Application No. 60/664,444, filed Mar. 22, 2005, both of which are assigned to the assignee hereof and both of which are expressly incorporated herein by reference.

FIELD

This invention relates to unassisted GPS-type position determination, in general, and, to improvements in such systems that reduce an initial time-to-fix, in particular.

BACKGROUND

In an unassisted GPS-type position determination system, subscriber stations determine their own positions from satellite transmissions originating from the GPS-type position determination system, without requesting significant acquisition or calculation assistance from other network entities, for example, dedicated servers. That places significant processing demands on the subscriber stations because of the uncertainty in the timing, position, and frequency of these transmissions, requiring the subscriber stations to expend significant processing resources in searching for and locating these transmissions by, for example, testing large numbers of hypotheses varying the assumed timing, position and frequency of the transmissions. Since the number of hypotheses that must be tested is often staggering, the time required to search for the transmissions can be inordinately long and consume an excessive amount of processing resources, even for subscriber stations with dedicated receiver chains.

The uncertainty experienced by the subscriber stations stems from several sources. Assuming GPS positioning, there is first the uncertainty in knowing which of the 32 GPS satellites are visible to the subscriber station. That uncertainty is present because a subscriber station, upon power up or before a position fix is available, has no basis for identifying which signals of these 32 satellites can be usefully received. The useful reception of satellite signals is referred to as an ability of the subscriber station to “see” the satellite emitting the signal, or, in other contexts, as the satellite being “visible” to the subscriber station.

This leads to inefficient searching because the subscriber station may waste considerable resources in searching for transmissions from satellites that are not visible to it, and which are therefore not useful for position determination purposes. For example, referring to FIG. 1, while satellites 54 a, 54 b, and 54 c are visible to subscriber station 50 located at position 51 on the earth's surface 52, satellites 56 a, 56 b, and 56 c are invisible to subscriber station 50, as they are located on the other side of the earth. Therefore, it would be wasteful for subscriber station 50 to search for the transmissions from satellites 56 a, 56 b, and 56 c during a position fix attempt.

In addition, there is an uncertainty in knowing the timing or phase of the 32 chip PN “gold” codes that are embedded within the individual satellite transmissions. As these codes are circularly shifted versions of one another, the phase of a code uniquely identifies which of the satellites originated the transmission. The phase also reflects the propagation delay caused from transmission from the satellite to the subscriber station. To account for the possible variations in phase, the subscriber station must expend resources in searching over the full range of possible PN codes within a code phase searching window that is large enough to encompass the possible variations.

Moreover, there is an uncertainty in knowing the relative movement between the subscriber station and the GPS satellites, which typically introduces a Doppler shift of approximately ±4 kHz in the frequency of transmission. To account for the possible variation of frequency introduced by the Doppler shift, the subscriber station must expend resources is searching over the full range of possible transmission frequencies within a frequency searching window that is large enough to encompass the possible variations caused by the Doppler shift.

Finally, there is the uncertainty in knowing the degree to which the local oscillator (LO) of the subscriber station is out of tune with the GPS carrier frequency. Upon power-up, for example, it is not uncommon for the LO frequency to differ from the GPS carrier frequency by as much as ±5 ppm. Until synchronization between the LO frequency and GPS carrier frequency is achieved, the subscriber station must account for this uncertainty by increasing the size of the frequency search window that is employed.

Even if the host wireless communications system or GPS-type position determination system eliminating some of this uncertainty by providing timing, positional information, or synchronization to the subscriber station, the processing demands on the subscriber station are often still substantial. For example, a synchronous system, such as a CDMA system, provides the subscriber station with time, and also synchronizes the LO frequency of the subscriber station to the GPS carrier frequency. Although the synchronization substantially reduces the LO frequency uncertainty, for example, from ±5 ppm to ±0.2 ppm, and the timing information allows the subscriber station to determine the position of the GPS satellites (using the GPS almanac or ephemeris data provided by the satellites), the subscriber station is still unable to determine which of the GPS satellites are visible to it, and it is still subject to the frequency uncertainty caused by Doppler shift.

SUMMARY

Disclosed is a method of deriving a seed position of a subscriber station that may be used in support of unassisted GPS-type position determination. In this method, the subscriber station receives an overhead message from a wireless communications system, and derives its seed position from values of a parameter in the overhead message.

For example, the seed position of the subscriber station may be set to base station positioning information identifying a base station or sector in communication with the subscriber station. In another example, the subscriber station may map an identifier of the host wireless communications system (such as the System Identifier (SID) of that system) into the seed position of the subscriber station using a data structure, such as a lookup table.

This method often results in greater efficiencies as the subscriber station may use the seed position to identify those satellites that are visible to it, thus reducing searching time. Or it may use the seed position to estimate the code phase shift caused by propagation delay or the Doppler shift caused by relative movement with a satellite, thus allowing for a reduction in the size of the code phase or frequency search windows.

A method is also provided for updating a data structure, either by adding new entries or updating existing entries, as new information becomes available, consistent with a “self-learning” mode of operation. For example, assuming GPS positioning, if a GPS fix indicates that a seed position derived from the data structure and used to initiate the fix is inaccurate, the data structure may be updated to correct the inaccuracy. As another example, if the GPS fix indicates the presence of a SID conflict, the data structure may be updated to reflect this. As another example, if IFAST (International Forum on ANSI-41 Standards Technology, the organization responsible for allocating SIDs) changes its SID allocations, the data structure might be updated to reflect that.

A system is also provided for deriving a seed position of a subscriber station from parameter values of an overhead message. A memory stores the data structure, associating possible parameter values with corresponding positional information. One or more processor in the system is configured to access the data structure stored in the memory to map the values of the parameter value to a corresponding position that serves as the seed position.

BRIEF DESCRIPTION OF THE DRAWINGS

The components in the figures are not to scale, emphasis instead being placed upon illustrating the principles of the invention. In the figures, like reference numerals designate like or corresponding parts.

FIG. 1 is a diagram illustrating both GPS satellites that are visible and invisible to a particular subscriber station.

FIG. 2A is a flowchart illustrating an embodiment of a method of deriving a seed position of a subscriber station from parameter values from an overhead message received from a wireless communications system.

FIG. 2B is a flowchart illustrating a particular implementation for deriving a seed position for a subscriber station that may be used in the method of FIG. 2A.

FIGS. 3A-3B illustrate the format of a CDMA 2000 System Parameters Message.

FIGS. 4A-4E illustrate the format of a CDMA 2000 Extended System Parameters Message.

FIGS. 5A-5B illustrate the format of a CDMA 2000 ANSI-41 System Parameters Message.

FIGS. 6A-6B illustrate the format of a CDMA 2000 In-Traffic System Parameters Message.

FIGS. 7A-7B illustrate the format of a 1xEVDO SectorParameters message.

FIGS. 8A-8G illustrate the IFAST SID allocation (sorted by SID) (as of Dec. 6, 2004).

FIGS. 9A-1, 9A-2 and 9B illustrate the SID conflicts identified by IFAST (as of Dec. 6, 2004).

FIG. 10A illustrates an example of a lookup table associating SID values with corresponding positions.

FIG. 10B illustrates an example of a lookup table associating SID ranges with corresponding positions.

FIG. 10C illustrates an example of a lookup table associating SID values or ranges with corresponding positions and position uncertainties.

FIG. 11 illustrates the format of a GSM/UMTS Location Area information element.

FIG. 12 illustrates the format of a GSM/UMTS Routing Area information element.

FIG. 13 illustrates the format of a GSM/UMTS PLMN information element.

FIG. 14 illustrates the format of a GSM/UMTS Cell Identity information element.

FIG. 15 illustrates the format of a GSM/UMTS Time Zone information element.

FIG. 16 is a flowchart of an embodiment of a method of mapping values of a parameter to a corresponding seed position of the subscriber station using data structure, and then updating the data structure responsive to the resulting GPS-type position fix.

FIG. 17 is a diagram illustrating various update scenarios to the data structure used in the mapping step of FIG. 16.

FIGS. 18A-18D show a time sequence of the flow of information through a particular memory configuration having at least one ROM, at least one non-volatile memory, and at least one RAM at various points in time, including at power-up and power-down.

FIG. 19 is a flowchart of an embodiment of a method of attempting to map values of a parameter to a corresponding seed position of the subscriber station using at least one lookup table, and updating the at least one lookup table if at least one entry associating the values of the parameter to a corresponding seed position are absent from the lookup table.

FIG. 20 is a diagram illustrating a circular coverage area defined by a centroid position and coverage radius for a particular country, and the relationship between this coverage area and the geographical limits of that country.

FIG. 21 is a flowchart of an embodiment of a method of updating at least one lookup table, the table associating a parameter value with corresponding positions and/or position uncertainties, responsive to information from a central server (such as the IFAST server at www.ifast.org).

FIGS. 22A-22C are a time sequence illustrating changes to a lookup table, having entries associating possible SID values or ranges with corresponding positions and position uncertainties, as SID conflicts are identified and/or resolved.

FIGS. 23A-23B present a table illustrating examples of overhead messages in various wireless communications systems, for example, CDMA 2000, 1xEVDO, GSM, UMTS, containing information that may be useful in deriving the seed position of a subscriber station.

FIG. 24 is a block diagram of an embodiment of a system for deriving a seed position of the subscriber station and then initiating a GPS-type position fix of the subscriber station based on acquisition assistance information derived from the seed position, the system having at least one processor in communication with a memory.

FIG. 25 is a block diagram of a particular implementation of the system of FIG. 24, with the at least one processor comprising a Position Engine (PE) ASIC processor for deriving the seed position of the subscriber station and then deriving acquisition assistance information from this seed position, and a Searcher Engine ASIC processor for initiating a GPS-type position fix responsive to the acquisition assistance information.

FIG. 26 is a block diagram of a detailed implementation example of the system of FIG. 25, in which the PE ASIC processor derives a seed position of the subscriber station responsive to information contained in six data structures, comprising a Latest GPS Fix data structure, a SID Latest data structure, a SID Self Learning Database, a SID Country Table Database, a Latest Base Station Information data structure, and a SID Serving data structure.

FIG. 27 illustrates an example format of the Latest GPS Fix data structure.

FIG. 28 illustrates an example format of the SID Latest data structure and the Latest Base Station Information data structure.

FIG. 29 illustrates an example format of an entry in the SID Self Learning Database.

FIG. 30 illustrates an example format of an entry in the SID Country Table Database.

FIGS. 31A-31G (shown as 31A-1 (right), 31A-2 (left), 31B-1 (right), 31B-2 (left), etc.) illustrate an augmented IFAST SID allocation table that may serve as the progenitor of the SID Country Table Database.

FIG. 32A illustrates an example of pseudo code for allocating, populating, and/or updating entries in the SID Self Learning Database.

FIG. 32B illustrates two scenarios for updating an entry in the SID Self Learning Database, the first involving the detection of a SID conflict, and the second involving the lack of a SID conflict.

FIG. 33 illustrates an example of pseudo code for aging the position uncertainty of the latest GPS fix forward to the current time.

FIG. 34 illustrates an example of pseudo code for aging the position uncertainty of the latest base station lat/lon position forward to the current time.

FIG. 35 illustrates an example of pseudo code for aging or otherwise deriving the position uncertainty for a GPS lat/lon position from a matching entry in the SID Self Learning Database.

FIGS. 36A-1, 36A-2 and 36B illustrates an example of pseudo code for aging the position uncertainty for a centroid position obtained from a matching entry in the SID Country Table Database.

DETAILED DESCRIPTION

As utilized herein, terms such as “approximately” and “substantially” are intended to allow some leeway in mathematical exactness to account for tolerances that are acceptable in the trade.

The term “fix” refers to an estimate of the position of a subscriber station derived using a GPS-type position determination system that is more precise than the seed position.

The phrase “GPS-type position determination system” means a system for determining a position of a subscriber station in a wireless communications system from satellite transmissions, including standalone systems and systems overlaid onto or integrated into a wireless communications system, and including systems where transmissions from the individual satellites are distinguished from one another through pseudorandom noise (PN) codes, different carrier frequencies and the like. Examples include the United States Global Positioning Satellite (GPS) system, where 1032 chip PN codes distinguish the individual satellite transmissions, the Russian GLONASS system, where individual satellites have different carrier frequencies, and the European GALILEO system. Additional examples include mobile based, unassisted, network based enhanced observed time difference of arrival (EOTA), and uplink time of arrival (TOA) position determination systems.

The phrase “GPS-type fix” means a position determination using a GPS-type position determination system.

The term “logic” refers to implementations of functionality in hardware, software, or combination thereof.

The term “memory” refers to any physical medium capable of storing information in electronic form, including but not limited to RAM, ROM, EPROM, PROM, EEPROM, disk, floppy disk, hard disk, CD-ROM, DVD, non-volatile memory, or the like, or a combination thereof.

The term “overhead message” refers to a message communicated between a wireless communications system and a subscriber station over any type of channel, including common and dedicated traffic channels, whose content is substantially other than subscriber station-to-subscriber station traffic. It will be understood that the singular term “overhead message,” “an overhead message,” or “the overhead message” is used herein to include one or more message, unless expressly indicated to the contrary.

A “parameter” is a value contained in an overhead message. It will be understood that the singular term “parameter,” “a parameter,” or “the parameter” is used herein to include one or more values, unless expressly indicated to the contrary.

The term “processor” refers to any logic, logic device, circuit, application specific integrated circuit (ASIC), chip, or any combination thereof, capable of executing a series of commands, instructions or state transitions, and includes, without limitation, a general- or special-purpose microprocessor, finite state machine, controller, computer, digital signal processor (DSP), or the like. It will be understood that the singular term “processor,” is used herein to include one or more processors, unless expressly indicated to the contrary.

The term “processor readable medium” refers to any memory capable of being accessed by a processor.

The term “satellite” includes space vehicles (SVs).

The term “seed position” refers to an approximate estimate of the position of a subscriber station in a wireless communication system that facilitates searching for one or more satellite transmissions originating from a GPS-type position determination system in an effort to more precisely fix the position of the subscriber station.

The term “software” includes source code, assembly language code, binary code, firmware, macro-instructions, micro-instructions, or the like, or any combination thereof.

The term “subscriber station” includes mobile stations (MS) and user equipment (UE).

The term “user equipment”, or “UE”, is used herein to designate cellular, cordless, Personal Communication System (PCS), or other types of wireless telephone devices, pagers, wireless personal digital assistants, notebook computers with wireless access, or any other wireless mobile device, two-way radios, walkie-talkies, or other type of communications transceiver, or mobile stations (MS), regardless of whether they have valid SIM or USIM identifiers.

The term “wireless communications system” includes wireless communication systems employing any multiple access mode or protocol, including synchronous and asynchronous systems. Examples include, but are not limited to, systems conforming to the IS-95 (CDMA), CDMA 2000 (1x), 1xEVDO, GSM, UMTS (WCDMA), or the like, standards or protocols.

With reference first to FIG. 2A, a flowchart of an embodiment 100 of a method of deriving a seed position of a subscriber station in a wireless communications system is shown. In this embodiment, the method is performed within the subscriber station in support of unassisted GPS-type position determination, and comprises two boxes, identified respectively with numerals 102 and 104. Box 102 comprises receiving an overhead message from a wireless communication system, and box 104 comprises deriving the seed position of the subscriber station from or responsive to values of a parameter in the overhead message.

FIG. 2B is a flowchart 200 of an implementation for deriving a seed position of the subscriber station from values of a parameter in the overhead message, box 104 of FIG. 2A. Box 202 comprises deriving a first estimate of the position of the subscriber station from the values of the parameter in the overhead message. Query 204 comprises querying whether a second estimate of the subscriber station's position with lower position uncertainty is available. If not, box 206 is performed. If so, box 208 is performed. In box 206, the seed position of the subscriber station is set to the first estimate of the position of the subscriber station. In box 208, the seed position of the subscriber station is set to the second estimate of the position of the subscriber station.

This implementation contemplates that a second estimate of the position of the subscriber station, such as a previous GPS-type fix of the subscriber station's position or a default position, for example, the subscriber's country of registration, is available for comparison with a first estimate derived from the values of the parameter from the overhead message, and that both estimates have corresponding position uncertainties. The seed position of the subscriber station in this implementation is set to whichever estimate has the lower position uncertainty.

The first estimate in this implementation may be derived from at least one of the values of an overhead message parameter indicating the position of a base station or base station sector in communication with the subscriber station. For example, the first estimate may be set to the position indicated by the BASE_LAT and BASE_LONG values from a System Parameters Message, an overhead message that is routinely communicated to the subscriber station by a CDMA 2000 wireless communications system and is defined by the applicable IS-2000 standard. The format of this message is illustrated in FIGS. 3A-3B, taken from Section 3.7.2.3.2.1, pages 3-107 to 3-115, of TIA-2000.5-D, March 2004. The BASE_LAT and BASE_LONG values from this message are, respectively, the latitude and longitude of a base station in a CDMA 2000 system serving the subscriber station.

More specifically, BASE_LAT is a 2's complement signed number indicating the latitude of the base station expressed in units of 0.25 second, with positive numbers indicating North latitudes and negative numbers indicating South latitudes. It ranges between −1296000 and +1296000, corresponding to the range −90° to +90° . Similarly, BASE_LONG is a 2's complement signed number indicating the longitude of the base station expressed in units of 0.25 second, with positive numbers indicating East longitudes and negative numbers indicating West longitudes. It also ranges between −1296000 and +1296000, corresponding to the range −90° to +90°. In practice, carriers that do not use these parameters set these values to 0, so a good rule of thumb to follow is that the values of these parameters are valid if non-zero.

As another example, the first estimate may be set to Latitude and Longitude values from a SectorParameters message, an overhead message that is routinely communicated to the subscriber station by a 1xEVDO wireless communications system and this is defined by the applicable IS-856 standard. The format of this message is illustrated in FIGS. 7A-7B, taken from Section 9.9.6.2.2, pages 9-134 to 9-141, of TIA-856-A, April 2004.

The Latitude and Longitude values from this message are, respectively, the latitude and longitude of a base station sector in a 1xEVDO system serving the subscriber station. More specifically, Latitude is a 2's complement signed number indicating the latitude of the base station sector expressed in units of 0.25 second, with positive numbers indicating North latitudes and negative numbers indicating South latitudes. It ranges between −1296000 and +1296000, corresponding to the range −90° to +90°. Similarly, Longitude is a 2's complement signed number indicating the longitude of the base station expressed in units of 0.25 second, with positive numbers indicating East longitudes and negative numbers indicating West longitudes. It also ranges between −1296000 and +1296000, corresponding to the range −90° to +90°.

The position uncertainty corresponding to this first estimate may be set to the maximum antenna range (MAR) of that base station or sector since the subscriber station may be anywhere within this range. The MAR for a particular base station or sector may be set dynamically based on information specific to that base station or sector, such as a list of neighboring base stations or sectors visible to the base station or sector in question, or the size of the search window used to search for such neighboring base stations or sectors. That information may be also be derived from at least one overhead message sent to the subscriber station, such as a Neighbors List Message, described in Section 3.7.1.3.2.3, pages 3-125 to 3-127, of TIA-2000.5-D, March 2004. Alternatively, the MAR may be set to a static default value, such as an average MAR applicable to all the base stations or sectors in the system.

The first estimate may, for example, be derived from at least one value of a parameter of the overhead message identifying a wireless communications system in communication with the subscriber station, a network within that system, an area within or encompassing that system or network, the subscriber station's country, or any combination of two or more of the foregoing. If the parameter does not directly indicate a position that can serve as the first estimate, its values may be mapped to a corresponding position that can serve as the first estimate, using a data structure associating possible values of the parameter with corresponding positions. For example, the data structure may comprise a lookup table having a plurality of entries associating possible values of the parameter with corresponding positions. The lookup table may be stored within a memory at least partially located within the subscriber station.

In one implementation, the first estimate is derived from a SID value, NID value, BASE_ID value, MCC value, value of any combination of any two or more of the foregoing, or value of any combination of the foregoing with one or more additional parameters, from overhead messages communicated to the subscriber station by a CDMA 2000 wireless communications system. The SID is an identifier of a CDMA 2000 system serving the subscriber station, the Network Identifier (NID) is an identifier of a network serving the subscriber station within that system, and BASE_ID is an identifier of a base station in that system or network serving the subscriber station. The MCC is a code identifying the subscriber station's country. The SID, NID and BASE_ID parameters are each a field in the System Parameters Message (FIGS. 3A-3B), and the ANSI-41 System Parameters Message, illustrated in FIGS. 5A-5B, taken from Section 3.7.2.3.2.30, pages 3-335 to 3-344 of TIA-2000.5-D, March 2004. The MCC is field in the Extended System Parameters Message, illustrated in FIGS. 4A-4E, taken from Section 3.7.2.3.2.13, pages 3-149 to 3-178 of TIA-2000.5-D, March 2004, and the ANSI-41 System Parameters Message (FIGS. 5A-5B). Accordingly, the SID, NID and BASE_ID values may be derived from selected ones of the foregoing messages as received by the subscriber station, and the MCC value may also be derived from certain of these messages.

In addition, the SID and NID values may also be derived from an In-Traffic System Parameters Message received by the subscriber station over a traffic channel while in active mode. The In-Traffic System Parameters Message is an overhead message defined by the IS-2000 standard. It is illustrated in FIGS. 6A-6B, taken from Section 3.7.3.3.2.7, pages 3-463 to 3-472 of TIA-2000.5-D, March 2004. Unlike the other messages, which are received over a pilot channel while the subscriber station is in idle mode, this message is received by the subscriber station over a traffic channel while the subscriber station is in active mode. Therefore, if the subscriber station has been in active mode for a sustained period of time, for example, because of a long voice/data call while the subscriber station is traveling on a freeway, the SID and NID values from this message may be the most accurate.

In one example, the first estimate is derived from a SID value communicated to the subscriber station by a CDMA 2000 wireless communications system through one of the foregoing messages. The subscriber station obtains the SID value from the message and maps it to a corresponding position using data structures such as lookup tables. That is possible because, with only a few exceptions, IFAST (International Forum on ANSI-41 Standards Technology), the organization responsible for allocating SID values to individual countries, uniquely allocates ranges of SID values by country. FIGS. 8A-8G illustrate the current (as of Dec. 6, 2004) allocation of SID ranges to countries, sorted in order of SID value. Using this allocation, a SID value may be mapped into a country and then the country mapped into a country position, for example, the centroid location of that country, that may serve as the seed position of the subscriber station. The exceptions, referred to by IFAST as “conflicts,” occur when the same SID value is utilized by carriers in more than one country. FIGS. 9A-9B illustrate the current (as of Dec. 6, 2004) conflicts identified by IFAST. An approach for dealing with these conflicts will be discussed subsequently.

Because of the relatively large granularity of a country-based SID allocation, an approach in which SID values are mapped into corresponding positions can be performed with a lookup table having relatively few entries that may be readily stored within a subscriber station and rapidly accessed.

FIG. 10A illustrates an embodiment 1000 of a lookup table that may be constructed from the IFAST SID allocations and stored in a memory of the subscriber station for use in mapping SID values into corresponding positions. The lookup table may, for example, comprises a plurality of entries 1002, 1004, 1006, associating possible SID values, SID₁, SID₂, SID_(N), with corresponding positions, POS₁, POS₂, POS_(N). In one example, the position corresponding to a particular SID value is the approximate centroid location of the country to which the SID value is allocated by IFAST. To perform the mapping, the subscriber station accesses the lookup table to locate the table entry that corresponds to the SID value in question, and returns the associated position as the seed position of the subscriber station.

FIG. 10B illustrates still another embodiment 1050 of a lookup table that may be constructed from the IFAST allocations and stored in memory of the subscriber station for use in mapping SID values into corresponding positions. Here, the lookup table may comprise a plurality of entries 1052, 1054, 1056, associating ranges of possible SID values, SID RANGE₁, SID RANGE₂, SID RANGE_(N), with corresponding positions, POS₁, POS₂. POS_(N). Since IFAST allocates ranges of SID values to a particular country, the lookup table in this embodiment likewise maps ranges of SID values into a corresponding position.

FIG. 10C illustrates yet another embodiment 1100 of the lookup table that may comprise a plurality of entries 1102, 1104 1106, associating ranges of possible SID values, SID RANGE₁, SID RANGE₂, SID RANGE_(N), individual SID values SID₁, SID₂, SID_(N), or combinations of SID ranges and individual SID values, with corresponding positions, POS₁, POS₂, POS_(N), and corresponding position uncertainty values, UNC₁, UNC₂, UNC_(N). As an example, where the corresponding positions are set to the centroid locations of the respective countries, the uncertainty values represent the radius of coverage from the centroid location or some other value indicating the range or area of coverage of the identified system. In some cases, the range or area of coverage can be measured by the geographical limits of the country involved. For example, the uncertainty value may simply be taken as the radius of a circle extending from the centroid location that narrowly circumscribes the full extent of the geographical area of the country involved. The area or range of coverage of the identified system serves as an accurate measure of the position uncertainty of the subscriber station because the subscriber station may be located anywhere within this area or range. This position uncertainty is a useful metric for selecting amongst multiple possible estimates of the subscriber station's position.

To facilitate searching through the lookup table, its entries may be ordered by priority, with higher priority entries appearing first. For example, the entries could be statically ordered, when the subscriber station is first activated in order of those countries most likely to be visited. Alternatively, the entries could be dynamically ordered. For instance, whenever the subscriber station is powered up, the entries are placed in order of those countries actually visited by the subscriber station over a previous time frame, for example, 6 months.

Another way by which retrieval may be facilitated is to store the entries in a content addressable memory, where the SID range or value for an entry forms the tag portion of the entry, and the corresponding position and the position uncertainty form the content portion of the entry. A SID value can be mapped to a corresponding position and/or position uncertainty in a single access with such a memory.

The entries of the table may also be assigned hash values to facilitate searching through the table. For example, groupings of entries may be assigned the same hash value, and the entries in the table then ordered by hash value. A hash function maps values of the at least one overhead message parameter to a hash value, which identifies the portion of the table at which searching should commence.

Entries in the table representing individual countries may also be aggregated to form a single entry representing an entire region. For example, the individual entries representing the Caribbean countries may be aggregated to form a single entry representing the Caribbean region.

In another implementation, the first estimate may be derived from a Country Code value, Sector ID value, a value of a combination of the two, or a value of any combination of the foregoing with one or more additional parameters, from an overhead message, such as the SectorParameters message (FIGS. 7A-7B), communicated to the subscriber station by a 1xEVDO wireless communications system. The Country Code is a code identifying the subscriber station's country, and is identical to the MCC discussed previously. The Sector ID is an identifier of the base station sector serving the subscriber station. The values of either or a combination of these two parameters may be mapped into a corresponding position or position uncertainty through suitable lookup tables associating values of these parameters with corresponding positions and position uncertainties.

For example, if the finer degree of granularity that is possible through joint use with the Sector ID results in a lookup table that either cannot fit within the available storage within the subscriber station, or takes too much time to access, the mapping may be performed using the Country Code alone. Thus, a Country Code value from a SectorParameters message communicated to the subscriber station by a 1xEVDO wireless communications system may be mapped into a corresponding position and position uncertainty using a lookup table of the type described previously. It should be noted that the term “position and position uncertainty” is used herein to designate either the position or the position uncertainty alternatively, or both the position and position uncertainty in combination, as any combination thereof is contemplated herein.

In a further implementation, the first estimate may be derived from an MCC value, MNC value, LAC value, RAC value, Cell Identity value, Time Zone value, value of any combination of two or more thereof, or value of any combination of the foregoing in combination with additional parameters, from overhead messages communicated to the subscriber station by a GSM or UMTS wireless communications system.

The values of the MCC, MNC, and LAC parameters may be obtained from the Location Area message (or “information element” in 3GPP parlance), illustrated in FIG. 11, and described in the applicable 3GPP GSM specification, Section 10.5.1.3, pages 288-290, 3GPP TS 24.008 v.3.19.0 (2004-06), R99, September 2004. This information element is an overhead message routinely broadcast by the system over the Broadcast Control Channel (BCCH) to aid the location update procedure performed while the subscriber station is in idle mode. The MCC (Mobile Country Code) is a code of the country of GSM or UMTS system serving the subscriber station. The MCN (Mobile Network Code) is a code of the GSM or UMTS network within that country serving the subscriber station. The LAC (Location Area Code) is a code of a specific area within the country or network of the GSM or UMTS system serving the subscriber station. The values of these parameters may be mapped into a corresponding position and position uncertainty using a suitable lookup table of the type described previously.

If a coarser granularity than that available from the Location Area information element is acceptable, then the value of the PLMN (Public Land Mobile Network) may be utilized, and mapped into a corresponding position and position uncertainty using a lookup table. The PLMN is the sole parameter of a PLMN Identity information element routinely broadcast over the BCCH to aid subscriber stations while in idle mode. It unambiguously identifies the carrier serving the subscriber station. The format is illustrated in FIG. 13, and is further described in the applicable 3GPP GSM specification, Section 10.3.1.11, page 398, 3GPP TS 25.331 v.3.20.0 (2004-09), R99, September 2004, RRC protocol specifications.

If a finer granularity than that available from the Location Area identification element is desired, assuming packet services are deployed by the carrier, then the parameters from the Routing Area information element may be utilized, and mapped into a corresponding position and position uncertainty using the lookup table. This information element as well is an overhead message routinely broadcast by the system over the BCCH to assist subscriber stations in idle mode. The format of this information element is illustrated in FIG. 12, and is described in the applicable 3GPP specification, Section 10.5.5.15, pages 380-381, 3GPP TS 24.008 v.3.19.0 (2004-06), R99, September 2004. In combination with values of the MCC, MNC, and LAC parameters described earlier, the RAC (Routing Area Code) provides an unambiguous identification of a routing area within a GPRS coverage area. Once again, the values of these parameters may be mapped into a corresponding position and position uncertainty using a suitable lookup table of the type described previously.

If even a finer granularity than that available from the Routing Area information element is desired, then the combination of the PLMN, available from the PLMN Identity information element described above, and Cell Identity, the sole parameter of a Cell Identity information element that is available in a UMTS system and that unambiguously identifies a cell within a PLMN, may be utilized. In this approach, the PLMN and Cell Identity combination is mapped into a corresponding position and/or position uncertainty using the lookup table. Again, the Cell Identity Information is routinely broadcast over the BCCH to aid subscriber stations while in idle mode. The format is illustrated in FIG. 14, and is further described in the applicable 3GPP GSM specification, Section 10.3.2.2, pages 400-01, 3GPP TS 25.331 v.3.20.0 (2004-09), R99, September 2004, RRC protocol specification.

Another approach involves mapping the Time Zone parameter, an indicator of the time zone of the subscriber station's current location and the sole parameter of the Time Zone information element, into a corresponding position and position uncertainty using at least one lookup table. The Time Zone information element is not always available, but for those carriers that provide it, the message is routinely broadcast over the BCCH in aid of subscriber stations in idle mode. The format is illustrated in FIG. 15, and is further described in Section 10.5.3.8, page 317, 3GPP TS 24.008 v.3.19.0 (2004-06), R99, September 2004.

In selecting among these various approaches, it should be appreciated that a finer granularity will lead to a more accurate estimate of the position of the subscriber station, and, hence, a better seed position of the subscriber station, but at the expense of a larger data structure or lookup table required to map the parameter values into a corresponding position and position uncertainty. Thus, one possible rule of thumb to follow is to select the approach that yields the highest granularity possible given the available subscriber station memory.

For example, since a lookup table mapping possible MCC values to corresponding positions and position uncertainties can readily be accommodated by most subscriber stations, the first estimate may be derived from the MCC alone. In this example, the MCC value, obtained from a Location Area information element or other overhead message communicated to the subscriber station by a GSM or UMTS wireless communications system, is mapped into a corresponding position, such as the centroid location of the country involved, and corresponding position uncertainty, such as the average radius of coverage, for example, 400 km, of a GSM or UMTS wireless network or the radius of a circle centered at the centroid and narrowly circumscribing the geographical extent of the country involved.

Referring back to FIG. 2B, the second estimate may be retrieved from a memory within the subscriber station, and represent a previous GPS-type fix of the subscriber station's position, such as the most recent such fix, or a default estimate of the subscriber station's position, such as an estimate based on the country of the subscriber's nationality or registration.

As another example, the second estimate may be a previous fix of the subscriber station's position as determined from a GPS-type positioning system, with a position uncertainty that depends on the age of the fix. For instance, the fix may be time-stamped, so the age of the fix is derivable from the difference in time between current time and the time-stamp. Here, the position uncertainty of the second estimate may be determined or calculated using the age, such as by multiplying the age of the second estimate by an assumed velocity of the subscriber station. If the age of the fix is greater than two hours, for instance, it may be assumed that the subscriber traveled by air during the intervening time period; whereas, if the age of the previous fix is less than two hours, it may be presumed that the subscriber traveled by automobile. Alternatively, the position uncertainty may be set to an empirically derived default value that depends on the age of the fix.

In FIG. 2B, the at least one parameter from which the first estimate is derived may also be time-stamped, allowing the age of these parameters to be derived from the difference in time between current time and the time from the time-stamp. Once the age of these parameters are determined, the position uncertainty of the first estimate may be determined or updated responsive to this age. Alternatively, the first estimate itself may be time-stamped, allowing the age of this estimate to be derived from the difference in time between current time and the time from the time-stamp. In this example, the position uncertainty of the first estimate is then determined or updated responsive to the age of the first estimate.

FIG. 16 is a flowchart of an embodiment 1600 of a method of updating data structure associating possible values of at least one overhead message parameter received by a subscriber station with corresponding positions. The method performed by the subscriber station is shown in boxes 1602, 1604, 1606, 1608, 1610 and 1612. Box 1602 comprises obtaining values of the parameter from the overhead message received by the subscriber station from a wireless communications system. Box 1604 comprises mapping the values to a corresponding position by accessing the data structure. Box 1606 comprises setting a seed position of the subscriber station to the corresponding position. Box 1608 comprises deriving a fix of the position of the subscriber station from satellite transmissions originating from a GPS-type position determination system, including searching for such transmissions responsive to the seed position. If an update condition is present, query 1610, the data structure is updated as represented by box 1612.

Here, a “self-learning” feature, the data structure, which may be any of the at least one lookup table previously described, may be updated as new information becomes available. For example, the lookup table may be updated over time, based on the position fix ultimately obtained from the GPS-type position determination system.

In another implementation, the data structure maps the values of the parameter to corresponding positions and position uncertainty values, where the position uncertainty values are coverage values indicating an area of coverage of a wireless system or network or entity. An update condition may be determined to be present if the GPS-type fix of the subscriber station's position is outside the area of coverage indicated by the mapped coverage value, indicating that area of coverage is not entirely accurate.

In another example, the data structure may comprise a lookup table having a plurality of entries associating possible values of the parameter with corresponding positions and coverage values. In one configuration, the lookup table may be of the form illustrated in FIG. 10C, and map SID values or ranges of SID values into corresponding positions and position uncertainties, wherein the position uncertainties are the coverage areas of the wireless systems identified by the respective SID values. In this configuration, referring to FIG. 17, a SID value is mapped to a centroid position 1706 and a radius of coverage R, which together define an area 1708 of coverage of the system identified by the SID value. An update condition is determined to be present if the fix 1702 of the subscriber station's position, as determined by a GPS-type position determination system using the centroid position 1706 as the seed position of the subscriber station, is outside the coverage area 1708. This indicates that either or both the centroid location 1706 or the coverage radius R are inaccurate. (Were the fix to be within the coverage area 1708, then no update would be necessary as the fix is consistent with the centroid position 1706 and coverage radius R.) In response to the update condition, one of three possible options may be undertaken.

In the first option, upon or after determining that an update condition is present, the mapped coverage radius as stored in the lookup table is simply extended so that the coverage area defined by the radius encompasses the fix of the subscriber station's position. Referring to FIG. 17, this approach might be appropriate in the case where the GPS-type position fix is at location 1710, just outside the coverage area 1708 represented by the centroid location 1706 and coverage radius R. In that case, the coverage radius R stored in the at least one lookup table is extended from R to R′, so that the new coverage area 1714 associated with the SID value encompasses the fix 1710.

In the second option, upon or after determining that an update condition is present, the entry associating the parameter value with a corresponding position and coverage value are replaced so that the parameter value maps into a new position or coverage value. Referring to FIG. 17, this approach might be appropriate in the case where the GPS-type position fix is at location 1702, far from the coverage area 1708 represented by the centroid location 1706 and coverage radius R. In that case, the entries in the lookup table for the SID value are replaced, so they associate the SID value with new centroid location 1716 and coverage radius R″, which together define a coverage area 1718 that encompasses the fix 1702.

In the third option, upon or after determining that the update condition is present, at least one new entry associating the parameter value with a position and coverage value are added to the lookup table, thus intentionally creating ambiguity in the form of a conflict situation. Referring again to FIG. 17, if the resultant GPS-type position fix is at location 1702, the existing entry mapping the SID value to centroid location 1706 and coverage radius R are unchanged, and at least one new entry is added mapping the SID value as well to centroid location 1716 and coverage radius R″. To resolve the conflict for future position fix attempts, depending on the distance between the position fix 1702 and the coverage area 1708 called for by the original entry, either the original or the new entry could be flagged to indicate which is most probable. During future position fix attempts, the most probable entry, which could change over time, would be used to determine the seed position of the subscriber station.

If, for example, the resultant position fix were to be at location 1710, which is close to the coverage area 1708 called for by the original at least one entry, the original entry could be flagged as most probable in relation to the other. Alternatively, were the resultant position fix to be located at position 1702, which is closer to or within the coverage area 1718 of another system, network or entity, the new entry could be flagged as more probable in relation to the other.

The lookup table may be stored in a memory within the subscriber station. FIG. 18A illustrates a particular configuration 1800 in which ROM 1804, non-volatile memory 1806, and RAM 1808 are present within the subscriber station. Each of these memories is accessible by at least one processor (not shown) through at least one bus 1802. In this configuration, the lookup table is divided between a fixed portion 1810 that is permanently stored in ROM 1804, and a variable portion 1812 that is stored in non-volatile memory 1806, while the subscriber station is powered down. As illustrated in FIG. 18B, when the subscriber station is powered up, the variable portion of the lookup table is copied into RAM 1808, which is the copy identified with numeral 1812′. As the subscriber station attempts a GPS-type position fix attempt, at least one update may be made to the copy 1812′ of the variable portion of the lookup table stored in RAM 1808. This updated copy is identified with numeral 1814 in FIG. 18C. During the process of powering down the subscriber station, the updated copy 1814 is stored as 1814′ in non-volatile memory 1806, as shown in FIG. 18D, thus preserving all the changes than have been made.

Referring again to FIG. 16, the mapping step 1604 may comprises mapping a SID value, NID value, BASE_ID value, value of any combination of two or more of the foregoing, or value of any combination of the foregoing with at least one additional parameter, from an overhead message communicated to the subscriber station by a CDMA 2000 wireless communications system, to a corresponding position. The mapping 1604 may comprises mapping a SID value from a System Parameters Messages communicated to the subscriber station by a CDMA 2000 wireless communications system to a corresponding position.

In another embodiment, the mapping 1604 may comprises mapping a Country Code value, Sector ID value, value of a combination of the two, or value of any combination of at least one of the foregoing with additional parameters, from overhead messages communicated to the subscriber station by a 1xEVDO wireless communications system, to a corresponding position. Thus, the mapping 1604 may comprise mapping a Country Code value from a SectorParameters message communicated to the subscriber station by a 1xEVDO wireless communications system to a corresponding position.

In yet another embodiment, the mapping 1604 may comprise mapping an MCC value, MNC value, LAC value, RAC value, Cell Identity value, Time Zone value, value of any combination of any two or more of the foregoing, or value of any combination of the foregoing with at least one additional parameter, from at least one overhead message communicated to the subscriber station by a GSM or UMTS wireless communications system, to a corresponding position. Thus, the mapping 1604 may comprise mapping an MCC value from a Location Area information element communicated to the subscriber station by a GSM or UMTS wireless communications system to a corresponding position.

FIG. 19 illustrates a method of updating a lookup table having a plurality of entries associating possible values of the parameter, obtainable from an overhead message communicated by a wireless communications system, with corresponding positions. As illustrated, this embodiment includes boxes 1902, 1904, 1906, 1908, and 1910.

Box 1902 comprises obtaining values of a parameter from an overhead message received by the subscriber station from a wireless communications system.

Box 1904 comprises accessing the table to determine if at least one entry is present associating the parameter value with a corresponding position.

Query 1906 comprises querying whether the entry associating the parameter value to a corresponding position is present in the lookup table.

Box 1908 comprises updating the lookup table to add a new entry if the query 1906 indicates the entry is not present in the lookup table. The new entry associates the values of the parameter with a corresponding position.

Box 1910 comprises setting the seed position of the subscriber station to the corresponding position if the entry is present in the lookup table.

The lookup table may be any of the lookup tables previously described. In this variant of the previously-described “self-learning” feature. In this variant, the lookup table is updated if the entry is absent associating particular values of the parameter with a corresponding position and position uncertainty. According to this update procedure, a new entry associating these particular values with a corresponding position and position uncertainty (one or both of which are derived from the GPS-type position fix) are added to the lookup table.

Box 1908 comprises updating the lookup table by adding a new entry associating the values of the parameter with a corresponding position. In addition, the added entry may also associate the parameter value with a corresponding position uncertainty, such as a presumed coverage radius. Thus, for example, where a lookup table associates SID values or ranges with corresponding country centroid locations and radii of coverage, the lookup table may be updated based on the position fix from the GPS-type position determination system. Referring to FIG. 20, the country 2002 encompassing the position fix 2004 is identified, and an entry is then added to the table associating the most recent SID value received by the subscriber station with the centroid position 2006 of the country 2002 and a presumed radius of coverage, R, for example, 400 kM, or an actual radius of coverage based on the geographical limits of the country.

FIG. 21 is a flowchart of another embodiment of a method of updating a lookup table having a plurality of entries associating possible values of the overhead message parameter with corresponding positions. This embodiment is illustrated by boxes 2102 and 2104.

Box 2102 comprises receiving an overhead message from a wireless communications system indicating that an update condition is present.

Box 2104 comprises updating the lookup table responsive to information from a central server accessible by the subscriber station.

The lookup table in this embodiment can be any of the lookup tables previously discussed or described. This embodiment is directed to a variant of the previously described “self-learning” feature, where the lookup table is updated based on information from a central server, and is updated in response to an overhead message from the wireless system indicating that the information on the server has changed.

The lookup table may associate possible SID values or ranges with corresponding country centroid positions, coverage ranges, or both, based on information including the IFAST allocation of possible SID values or ranges to countries as maintained by IFAST on a server accessible over the Internet at www.ifast.org. Here, the wireless system monitors the contents of the server, and periodically broadcasts an overhead message to subscriber stations, instructing them to update their lookup tables based on changes in the SID allocations or identified SID conflicts that are maintained on the IFAST server.

As an example, the wireless system may broadcast the update message on a relatively infrequent basis, for example, every six months, tied to the frequency with which updates are made to the information stored on the IFAST server. As another example, the wireless system broadcasts the message whenever the volume of updates to the IFAST information has exceeded a threshold level since the last update procedure.

In another embodiment, any of the previously discussed methods (FIGS. 1, 2A, 2B, 16, 19, 21) are tangibly embodied as a series of software instructions stored on a processor readable medium.

In yet another embodiment, at least one article of manufacture is provided that comprises a memory in a subscriber station in a wireless communications system. The memory stores a data structure, and the data structure associates a plurality of possible values of a parameter, obtainable from an overhead message communicated by a wireless communications system, with corresponding positions. The data structure may also associate the possible values of the parameter with corresponding position uncertainties. And the data structure may also comprise a lookup table having a plurality of entries associating the possible values of the parameter with corresponding positions. The lookup table may comprise any of the lookup tables previously described or illustrated. Examples of this embodiment are illustrated in FIGS. 18A-18D.

In the case where the data structure is implemented as a lookup table, the plurality of entries in the lookup table may be stored in order of priority. Or, the plurality of entries may each be associated with a hash value, and stored in ascending or descending order of the hash value, with a hash function available to map values of the overhead message parameters to a hash value. And, as illustrated in FIGS. 18A-18D, the memory may be ROM memories, RAM memories, non-volatile memories, or combinations of the foregoing.

Examples are also possible wherein at least some of the entries conflict. FIG. 22A illustrates an example of a lookup table 2200 having two conflicting entries, identified with numerals 2206 and 2208. Entry 2206 associates the SID range SID_(r)-SID_(s) with a first position, POS₁, and first position uncertainty, UNC₁, while entry 2208 associates the SID value SID_(r) with a second position, POS₂, and second position uncertainty, UNC₂. The entry 2206 might represent, for example, an authorized SID allocation by IFAST, while entry 2208 might represent unauthorized use of the SID value SID_(r) by a carrier in another country. The conflict may either be identified by IFAST (FIGS. 9A-9B) or discovered through invocation of the method of FIG. 16.

As another example, all the entries in the table have a C bit, identified with numeral 2202, for indicating whether the entry is in conflict with another entry. Thus, the C bits for entries 2206 and 2208 are both set (represented by the X in the figure), indicating that these two entries conflict with one another for the SID value SID_(r). All the entries in the table also have an M bit, identified with numeral 2204, for indicating which of the two or more conflicting entries for a SID value or range is most probable. In FIG. 22A, the M bit for entry 2206 is set, indicating that entry is more probable than entry 2208 because it represents an authorized IFAST SID allocation, whereas entry 2208 represents an unauthorized SID use by a carrier.

Over time, these bits can change. For example, entry 2208 could later be deemed to be more probable than entry 2206. In that case, through invocation of the method of FIG. 16, as illustrated in FIG. 22B, the M bit for entry 2208 is set, reflecting the changed status of entry 2208 in relation to entry 2206.

Over time, the entries may also change. For example, in FIG. 22A, entry 2208 could be an entry newly added through invocation of the method of FIG. 16. Or, as illustrated in FIG. 22C, if the conflict is resolved because, for example, the carrier ceases unauthorized use of SID_(r) and/or this SID value is taken off the list of identified conflicts maintained on the IFAST server (FIGS. 9A-9B), through invocation of the method of FIG. 21, entry 2208 would be deleted.

In another embodiment, the data structure associates possible SID values, NID values, BASE_ID values, values of any combination of two or more of the foregoing, or values of any combination of the foregoing with at least one additional parameter, obtainable by the subscriber station from an overhead message communicated by a CDMA 2000 wireless communications system, with corresponding positions. The data structure may associate possible SID values, obtainable by the subscriber station from a System Parameters Message communicated by a CDMA 2000 wireless communications system, with corresponding positions. In this implementation, the data structure may also associate the possible SID values with corresponding position uncertainties.

In yet another embodiment, the data structure associates possible Country Code values, Sector ID values, values of the combination of the two, or values of any combination of the foregoing with one or more additional parameters, obtainable by the subscriber station from overhead messages communicated by a 1xEVDO wireless communications system, with corresponding positions. In one implementation, the data structure associates possible Country Code values, obtainable from a SectorParameters message communicated to the subscriber station by a 1xEVDO wireless communications system, with corresponding positions. In this implementation, the data structure may also associate the possible Country Code values with corresponding position uncertainties.

In still another embodiment, the data structure associates possible MCC values, MNC values, LAC values, RAC values, Cell Identity values, Time Zone values, values of any combination of any of the foregoing, or values of any combination of the foregoing with one or more additional parameters, obtainable from overhead messages communicated to the subscriber station by a GSM or UMTS wireless communications system, with corresponding positions. In one implementation, the data structure associates possible MCC values, obtainable from a Location Area information element communicated by a GSM or UMTS wireless communications system, to corresponding positions. As an example, the data structure may associates the possible MCC values with corresponding position uncertainties.

FIG. 23A summarizes in table form examples of some of the parameters that may be used in the lookup table for a CDMA 2000 or 1xEVDO system, while FIG. 23B summarizes in table form examples of some of the parameters that may be used in the lookup table for a GSM or UMTS system. Other examples are possible so nothing in these tables should be taken as limiting.

FIG. 24 is a block diagram of embodiment 2400 of a system for deriving a seed position for a subscriber station. In this embodiment, one or more memories 2404 a, 2404 b, 2404 c are configured to store a data structure associating possible values of a parameter, obtainable by the subscriber station from an overhead message communicated by a wireless communications system, with corresponding positions. In addition, processors 2402 a, 2402 b, 2402 c are configured to (1) obtain values of the parameter from the overhead message communicated by a wireless communications system; (2) access the data structure stored in one or more of the memories in order to map the values of the parameter to a corresponding position; and (3) derive a seed position of the subscriber station responsive to the access. The memories 2404 a, 2404 b, 2404 c are accessible to the processors 2402 a, 2402 b, 2402 c through bus 2406.

The processors 2402 a, 2402 b, 2402 c may be further configured to: (1) search for satellite transmissions originating from a GPS-type position determination system responsive to the seed position of the subscriber station; and (2) derive a fix of the position of the subscriber station from such transmissions. As an example, the processors 2402 a, 2402 b, 2402 c may be configured to set the seed position of the subscriber station to the corresponding position mapped using the data structure provided another estimate of the subscriber station's position having lower position uncertainty is unavailable.

The data structure may comprise at least one lookup table having a plurality of entries associating possible values of the parameters with corresponding positions. The plurality of entries of the lookup table may also associate the possible values of the parameters with corresponding position uncertainties.

FIG. 25 is a block diagram of an implementation 2500 of the system. In this particular implementation, the processors comprise a position engine 2502 a for deriving the seed position of the subscriber station, and a searching engine 2502 b for fixing the position of the subscriber station responsive to the seed position. In this implementation, the memory comprises ROM 2504 a, non-volatile memory 2504 b, and RAM 2504 c, each accessible to the processors through bus 2506.

The data structure in this implementation has a fixed portion and a variable portion. The fixed portion is stored in ROM 2504 a, and a master copy of the variable portion is stored in non-volatile memory 2504 b while the subscriber station is powered down. Upon power up, a copy of the variable portion is stored in RAM 2504 c. Any updates to the variable portion while the subscriber station is powered up are made to this variable portion. When the subscriber station is powered down, the updated copy in RAM 2504 c is stored in the non-volatile memory 2504 b, overwriting the previous master copy and serving as the new master copy.

As an example, as represented by the table of FIG. 23A, the data structure associates possible SID values, NID values, BASE_ID values, values of any combination of two or more of the foregoing, or values of any combination of the foregoing with at least one additional parameters, obtainable by the subscriber station from overhead messages communicated by a CDMA 2000 wireless communications system, with corresponding positions. In one configuration, the data structure may associate possible SID values, obtainable by the subscriber station from a System Parameters Message communicated by a CDMA 2000 wireless communications system, with corresponding positions. In this configuration, the data structure may also associate the possible SID values with corresponding position uncertainties.

In another example, also represented by the table of FIG. 23A, the data structure may associate possible Country Code values, Sector ID values, values of the combination of the two, or values of any combination of the foregoing with at least one additional parameter, obtainable by the subscriber station from overhead messages communicated by a 1xEVDO wireless communications system, with corresponding positions. In one configuration, the data structure may associate possible Country Code values obtainable from a SectorParameters message communicated by a 1xEVDO wireless communications system with corresponding positions. In this configuration, the data structure may also associate the possible Country Code values with corresponding position uncertainties.

In still another example, represented by the table of FIG. 23B, the data structure associates possible MCC values, MNC values, LAC values, RAC values, Cell Identity values, Time Zone values, values of any combination of any two or more of the foregoing, or values of any combination of the foregoing with at least one additional parameter, obtainable from overhead messages communicated by a GSM or UMTS wireless communications system, with corresponding positions. In one configuration, the data structure may associate possible MCC values, obtainable from a Location Area information element communicated by a GSM or UMTS wireless communications system, to corresponding positions. In this configuration, the data structure may also associate the possible MCC values with corresponding position uncertainties.

In yet another example, referring to FIG. 26, six data structures may be maintained, comprising the Latest GPS Fix data structure 2602, the SID Latest data structure 2604, the SID Self Learning Database 2606, the SID Country Table Database 2608, the Latest Base Station Information data structure 2610, and the SID Serving data structure 2612. An ASIC processor, position engine 2616, accesses these six data structures and, responsive thereto, outputs a seed position of the subscriber station, identified with numeral 2614.

An example format of the Latest GPS Fix data structure 2602 is illustrated in FIG. 27. As illustrated, the Lat_gps and Lon_gps fields represent the latest GPS fix of the subscriber station's position (in degrees), and the gpsWeek_gps and gpsMs_gps fields comprise a time-stamp of the time at which the latest GPS fix was taken, with the gpsWeek_gps field indicating the week in which that fix was taken, and gpsMs_gps indicating the time (in milliseconds) during that week the GPS fix was taken. The Position_Unc_gps field represents the inherent position uncertainty (in meters) of the latest GPS fix.

These values are all updated (in RAM) (1) when the subscriber station is powered up, or (2) when a GPS fix is available, either by the PE or some other processor within the subscriber station. When the subscriber station is powered down, the contents of this data structure are written into non-volatile memory.

An example format of the SID Latest and Latest Base Station Information data structures 2604, 2610 are illustrated in FIG. 28. Within the SID Latest data structure 2604, the SlDlatest field holds the latest serving SID for the subscriber station, and the gpsWeek and gpsMs fields hold a time-stamp of this latest serving SID. Again, gpsWeek holds the week SlDlatest was last updated, and gpsMs holds the time (in milliseconds) within that week the update occurred.

Within the Latest Base Station Information data structure 2610, the BSLat and BSLon fields hold, respectively, the latitude and longitude (in radians) of the base station serving the subscriber station. The Dmar field holds the MAR for this base station, as derived from the size of the search window used by the base station to search for pilots of neighboring base stations. The gpsWeek_BsInfo and gpsMs_BsInfo fields hold a time-stamp of the time the BSLat and BSLon fields were last updated, expressed in terms of the week and the time within that week the update occurred.

The values of the SID Latest data structure 2604 are updated (in RAM) (1) when the subscriber station is powered up, (2) when an out of service (OOS) condition is detected, or (3) when a handoff to a new serving system occurs, as each of these occurrences should trigger the host wireless system to communicate overhead messages (such as a CDMA 2000 System Parameters Message) to the subscriber station including a SID identifying the last serving system. More specifically, when an OOS condition occurs, the SID of the serving system just prior to onset of the OOS condition is stored in SIDlatest, and when a handoff condition occurs, the SID of the serving system just prior to the handoff is stored in SIDlatest. Again, these updates may be performed by the PE or some other processor within the subscriber station. And the contents of this data structure are written into non-volatile memory when the subscriber station is powered down.

The values of the Latest Base Station Information data structure 2610 are updated (in RAM) (1) when a power up condition occurs, or (2) non-zero values of BSLat and BSLon are found in overhead messages (such as a CDMA 2000 System Parameters Message) received from the host wireless system, it being assumed that non-zero values of these fields are valid, while zero values indicate the fields are not used. Again, these updates may be performed by the PE or some other processor within the subscriber station. And, as before, the contents of this data structure are written into non-volatile memory when the subscriber station is powered down. These values are updated when the subscriber station is in service during IDLE or ACCESS modes.

The SID Serving data structure 2612 contains a field, SIDserving, that holds the SID of the current serving wireless system, and fields holding a time stamp of the time the SIDserving field was last updated. If the subscriber station is OOS, the value of SIDserving is 0. If the subscriber station is in service, then SIDserving is a number in the range of 1 to 32767. Normally, SIDserving and SIDlatest hold the same value, but there are circumstances where the two will differ. For example, when the subscriber station is OOS, SIDserving will be 0, while SIDlatest will hold the SID of the serving system just prior to the OOS condition. Similarly, when the subscriber station has undergone a handoff from one system to another, SIDlatest will hold the SID of the serving system just prior to the onset of the handoff condition, while SIDserving will hold the SID of the serving system after the handoff.

The SID Self Learning Database 2606 is a circular fixed size array with entries sorted by GPS time, with each having the format illustrated in FIG. 29. The size of the array is chosen based on typical travel assumptions. Assuming a typical subscriber travels between Korea, Japan, and the United States, a fixed size array of 55 entries may be appropriate. Each entry is initially set to a default null value. The entries are then populated as GPS fixes are obtained while the subscriber station is in service. When the subscriber station is out of service, updating or populating of the entries is not performed, even as GPS fixes are obtained.

When a GPS fix is obtained while the subscriber station is in service, the SID Self Learning Database 2606 is consulted to determine if an entry is present keyed to the current value of SIDserving. If such an entry is not present, an entry is allocated to this SID. If an unpopulated entry is not available, the oldest populated entry is allocated. (This is the only method by which a populated entry expires.) The newly allocated entry is then populated in accordance with the pseudo-code of FIG. 32A. If an entry keyed to SIDserving is already present, selected fields of that entry may be updated, again through the pseudo-code of FIG. 32A. Since that pseudo-code governs both updates to existing entries, and the population of newly allocated entries, an explanation of its operation will now be provided.

Referring to FIG. 32A, a default coverage radius, RadiusSL, is set to 400 km, a value which is configurable. A check is then made to determine if an entry keyed to SIDserving is present in the SID Country Table Database 2608, which associates the value of SIDserving with a centroid location and a coverage radius. If so, the variables CentroidCountry and RadiusCountry are respectively set to these values. A variable DeltaRadius is also set to the difference in position between the GPS fix and the centroid location of the country. If the value SIDserving cannot be associated with a centroid location and coverage radius because an entry keyed to SIDserving is not found in the SID Country Table Database 2608, the variable RadiusCountry is set to RadiusSL, the default coverage value, and the variable DeltaRadius is set to 0 (thus guaranteeing that a conflict condition will not be detected, consistent with the lack of an entry in the SID Country Table Database 2608).

If DeltaRadius is greater than RadiusCountry, indicating that the GPS fix is outside the coverage area for the country as indicated by the SID Country Table Database 2608, a conflict condition is detected. Accordingly, the value of the mask field, in either the newly allocated entry or existing entry, whichever situation is present, is set to a logical “1” to indicate the presence of a conflict for SIDserving. Otherwise, the value of the mask field is cleared to a logical “0” to indicate the absence of a conflict condition.

An example of these two situations is illustrated in FIG. 32B. There, it is assumed that an entry the SID Country Table Database 2608 associates SIDserving with centroid location 3208 and coverage radius 3206, which together define coverage area 3202 (the area within the circle). The variable CentroidCountry is set to the value 3208, and the variable RadiusCountry is set to the value 3206. If the GPS fix is gps1, then the variable DeltaRadius is set to the value identified with numeral 3204, the difference between the position represented by gps1 and the centroid location 3208. A conflict is then detected because the value of DeltaRadius exceeds that of RadiusCountry, indicating that gps1 is outside the designated coverage area of SIDserving (the area represented by the circle). According, the mask value, in either the existing entry or newly allocated entry of SID Self Learning Database 2606, is set to a logical “1.” By contrast, if the GPS fix is gps2 (the same as the centroid location 3208), then the variable DeltaRadius is set to 0, indicating that gps2 is coincident with centroid location 3208. A conflict is not detected in this case because the value of DeltaRadius does not exceed that of RadiusCountry, thus indicating that gps2 is within the designated coverage area of SIDserving.

Once the value of the mask field of the entry is set or cleared as appropriate, the latitude and longitude of the GPS fix are then stored respectively in the latitude and longitude fields of the entry, and the time stamp of the GPS fix, represented by the week and time (in mS) during the week the GPS fix occurred, are stored respectively in the gpsWeek and gpsMs fields. The pseudo-code then completes execution.

Note that, through execution of the pseudo-code, if no entry keyed to SIDserving is present in either SID Self Learning Database 2606 or SID Country Table Database 2608, indicating SIDserving has not been previously encountered and is also not associated with any country represented in the SID Country Table Database 2608, an entry keyed to SIDserving is added to the SID Self Learning Database 2606 that contains the position and time-stamp of the GPS fix that occurred while the subscriber station is being serviced by SIDserving. That is useful because, when SIDserving is encountered in the future, the GPS fix position (with a position uncertainty reflecting the age of the GPS fix) may then serve as the seed position of the subscriber station.

The updating and populating of entries in the SID Self Learning Database 2606 occur in RAM and are performed by the PE or some other processor when a GPS fix is obtained and the subscriber station is currently in service. When the subscriber station is powered down, the contents of this data structure as stored in RAM are stored in non-volatile memory, thus ensuring that the updates and newly populated entries are preserved.

The SID Country Table Database 2608 is a lookup table having entries each associating a consecutive range of SIDs with a country centroid location and coverage range. An example format of an entry in this database is illustrated in FIG. 30. The SIDstart field holds the starting SID in the range, the SIDend field holds the ending SID in the range, the latitude and longitude fields hold, respectively, the centroid latitude and longitude of the associated country (each in units of 0.0001 radian), and the radius field holds the coverage radius (in km) of the associated country.

In this example, the SID Country Table Database 2608 is a fixed table stored in ROM that is not changed after the subscriber station is activated and put in service. Rather, during manufacture, the table is populated using a current table of SID ranges as obtained from www.ifast.org (see FIGS. 8A-8G for an example), and then fixed in ROM. If a SID is newly assigned to a country after the SID Country Table Database 2608 is fixed, the situation is handled through an entry in the SID Self Learning Database 2606.

To populate the table, the current table of SID ranges from www.ifast.org is downloaded and sorted by SID range. Each entry is augmented with a hash field holding a hash value inversely related to the priority of the entry, centroid location fields (latitude and longitude) holding the centroid location of the associated country, and a coverage radius field holding the radius of coverage. The hash value assigned to an entry is inversely related to the degree to which the subscriber is expected to travel to that country. For example, for a subscriber expected to travel extensively between the United States, Japan, and South Korea, the United States-associated entries might be assigned a hash value of 1, indicating highest priority, the Japan-associated entries might be assigned a hash value of 2, indicating the next highest priority, and the South Korean-associated entries might be assigned a hash value of 3, indicating the next highest priority. As fixed in ROM, the table will be ordered by hash value in ascending order, with the highest priority entries at or towards the top. The centroid location for an entry is the midpoint between the maximum and minimum positions for the country, and the coverage radius for an entry is the coverage radius of the circular area centered at the centroid location that encompasses the entirety of the country.

Once the table has been augmented, multiple entries in the table may then be consolidated as appropriate. For example, multiple entries for the Caribbean countries may be consolidated into a single entry for the entire Caribbean region. To consolidate multiple entries, the SID ranges of the individual entries, when combined, should form a single consecutive range of SIDs. The centroid position field is then loaded with the centroid position of the entire region, and the coverage radius field is filled with a radius value that defines a circle centered at the centroid location that encompasses the entire region. The entries in the table are then ordered by priority based on the hash value assigned to each entry.

FIGS. 31A-31G illustrate a SID range table that has been downloaded from www.ifast.org and augmented in part in the manner described to form a precursor of SID Country Table Database 2608. The entries in the table are divided into 19 groups, and the entries in each group are assigned a hash value in the range 1-18 inversely proportional to the priority of the entries in the group. For example, the largely U.S.-associated entries within the SID range 1 to 7807 are assigned a hash value of 1, representing the highest priority entries, the Japan-associated entries within the SID range 12288 to 13311 are assigned a hash value of 2, representing the next highest priority level, etc. Notably, all the Caribbean associated entries are consolidated into a single entry representing the entire Caribbean region that is assigned a hash value of 15.

A high level algorithm for determining the seed position of the subscriber station will now be discussed. Whether the subscriber station is in service (IS) or out of service (OOS), the algorithm involves evaluating all the possible sources of the seed position, and selecting the source that has the lowest position uncertainty. The algorithm proceeds in five stages, determining a possible seed position and corresponding position uncertainty at each stage, and populating two vectors, SeedPosition(i), 1≦i≦5, and SeedUncetainty(i), 1≦i≦5, at each stage.

In the first stage, the position uncertainty associated with the latest GPS fix is aged to current time using the pseudo-code of FIG. 33. According to this pseudo code, TimeDelta, equal to the difference in time between the current time and the time tagged to the GPS fix, is calculated. If this TimeDelta value is less than 2 hours, the assumed velocity of the subscriber station, seedpos_MsSpeedMax, is set to an assumed automobile velocity, seedpos_MsSpeedMax_car, for example, 33.975 m/s (76 mph), and is otherwise set to an assumed airplane velocity, seedpos_MsSpeedMax_air, for example, 178.816 m/s (400 mph), reflecting an assumption that the subscriber station traveled by air if the time since the latest GPS fix equals or exceeds 2 hours. The assumed velocity, seedpos_MsSpeedMax, is then multiplied by the TimeDelta value to arrive at the incremental position uncertainty due to the aging of the GPS fix. This value is then added to the inherent position uncertainty of the GPS fix, GPS Fix Position Uncertainty (Position_Unc_gps in FIG. 27), to arrive at the aggregate position uncertainty of the latest GPS fix, which is stored in SeedUncertainty(1). The first potential seed position, SeedPosition(1), is set to the latest GPS fix.

Perscribed “early exit” criteria may then be evaluated to determine whether it is necessary to proceed with the remaining stages. In one embodiment, if SeedUncertainty(1), the aged position uncertainty associated with the latest GPS fix, is within a typical GPS accuracy fix requirement, for example, 8 GPS chips or equivalently 2400 meters, then the seed position of the subscriber station is taken to be the latest valid GPS fix, and algorithm terminates without proceeding to the next stages. By the same token, if SeedUncertainty(1) is outside the range of this typical requirement, then the algorithm proceeds with the next stages.

In the second stage, if the Latest Base Station Information data structure 2610 holds non-zero values of the latitude and longitude of the serving base station, the position uncertainty of these values is aged to current time by executing the pseudo code of FIG. 34 if data structure 2610 holds non-zero values of base station lat/lon.

Similar to the code of FIG. 33, in the code of FIG. 34, TimeDelta, equal to the difference in time between the current time and the time tagged to the base station lat/lon values, is calculated. If this TimeDelta value is less than 2 hours, the assumed velocity of the subscriber station, seedpos_MsSpeedMax, is set to an assumed automobile velocity, seedpos_MsSpeedMax_car, for example, 33.975 m/s (76 mph), and is otherwise set to an assumed airplane velocity, seedpos_MsSpeedMax_air, for example, 178.816 m/s (400 mph). The assumed velocity, seedpos_MsSpeedMax, is then multiplied by the TimeDelta value to arrive at the incremental position uncertainty due to the aging of the base station lat/lon values. This value is then added to the inherent position uncertainty of the base station position (Dmar in FIG. 28) to arrive at the aggregate position uncertainty of the base station lat/lon position, UncertaintyBSlatlon. This value is then compared with a default position uncertainty, associated with the assumption that the subscriber station is located somewhere on the face of the earth, with a position uncertainty that encompasses the entirety of the earth. If less than the default position uncertainty, the second instantiation of the position uncertainty, PositionUncertainty(2), is set to UncertaintyBSlatlon. If greater than the default position uncertainty, PositionUncertainty(2) is set to the default position uncertainty. In either case, the second possible seed position, SeedPosition(2), is set to the base station lat/lon position.

In the third stage, pseudo code of FIG. 35 is executed to determine if a seed position is possible from a matching entry in the SID Self Learning Database 2606. If the subscriber station is out of service, and the SID Self Learning Database 2606 holds a matching entry for SIDlatest, the position uncertainty associated with this matching entry is aged to current time. Similar to the code of FIG. 34, in the code of FIG. 35, TimeDelta, equal to the difference in time between the current time and the time tagged to the GPS stored in the matching entry, is calculated. If this TimeDelta value is less than 2 hours, the assumed velocity of the subscriber station, seedpos_MsSpeedMax, is set to an assumed automobile velocity, seedpos_MsSpeedMax_car, for example, 33.975 m/s (76 mph), and is otherwise set to an assumed airplane velocity, seedpos_MsSpeedMax_air, for example, 178.816 m/s (400 mph).

The assumed velocity, seedpos_MsSpeedMax, is then multiplied by the TimeDelta value to arrive at the incremental position uncertainty due to the aging of the GPS lat/lon values from the matching entry. This value is then added to the inherent position uncertainty of the GPS lat/lon position, seedpos_default_sid_uncertainty, to arrive at the aggregate position uncertainty of the GPS lat/lon position from the matching entry. This value is then compared with a default position uncertainty, associated with the assumption that the subscriber station is located somewhere on the face of the earth, with a position uncertainty that encompasses the entirety of the earth. If less than the default position uncertainty, the third instantiation of the position uncertainty, SeedUncertainty(3), is set to the aggregate position uncertainty of the GPS lat/lon position from the matching entry. If greater than the default position uncertainty, SeedUncertainty(3) is set to the default value. In either case, the third possible seed position, SeedPosition(3), is set to the GPS lat/lon position from the matching entry.

If the subscriber station is in service, and a matching entry is present in database 2606 that matches SIDserving, aging of the GPS lat/lon position from the matching entry is deemed unnecessary. In this case, SeedUncertainty(3) is set to the inherent position uncertainty of the GPS lat/lon position, seedpos_default_sid_uncertainty, and SeedPosition(3) is set to the GPS lat/lon position from the matching entry.

If the subscriber station is out of service and an entry in database 2606 is absent that matches SIDlatest, or the subscriber station is in service and an entry in database 2606 is absent that matches SIDserving, the pseudo code of FIG. 35 is skipped.

In the fourth stage, the pseudo code of FIGS. 36A-36B is executed to determine if a seed position is possible based on a matching entry in the SID Country Table Database 2608. The first portion of the code, illustrated in FIG. 36A, governs in the case when the subscriber station is out of service. In this portion of the code, if SIDlatest is not defined in data structure 2604, execution of this pseudo code is aborted, and program control is returned without calculating a fourth instantiation of SeedPosition and SeedUncertainty. If a matching entry for SIDlatest in SID Self Learning Database 2606 indicates the presence of a conflict, or a matching entry for SIDlatest is absent from the SID Country Table Database 2608, then SeedUncertainty(4) is set to the default value of the whole earth, and SeedPosition(4) is set to a default value of 0 lat and 0 lon. If a matching entry is present in SID Country Table Database 2608, and a conflict condition is not indicated for SIDserving, then RadiusCountry is set to the coverage radius from the matching entry in the SID Country Table Database 2608, and the position uncertainty for SIDserving, also equal to RadiusCountry, is then aged to the current time. To accomplish this, TimeDelta, equal to the difference in time between the current time and the time tagged to the SIDlatest, is calculated. If this TimeDelta value is less than 2 hours, as before, the assumed velocity of the subscriber station, seedpos_MsSpeedMax, is set to an assumed automobile velocity, seedpos_MsSpeedMax_car, for example, 33.975 m/s (76 mph), and is otherwise set to an assumed airplane velocity, seedpos_MsSpeedMax_air, for example, 178.816 m/s (400 mph).

The assumed velocity, seedpos_MsSpeedMax, is then multiplied by the TimeDelta value to arrive at the incremental position uncertainty due to the aging of SIDlatest. This value is then added to the inherent position uncertainty of the centroid location corresponding to SIDlatest, RadiusCountry, to arrive at the aggregate position uncertainty of this centroid location. This value is then compared with a default position uncertainty, associated with the assumption that the subscriber station is located somewhere on the face of the earth, with a position uncertainty that encompasses the entirety of the earth. If less than the default position uncertainty, the fourth instantiation of the position uncertainty, SeedUncertainty(4), is set to the aggregate position uncertainty of the centroid position from the matching entry. If greater than the default position uncertainty, SeedUncertainty(4) is set to the default value. In either case, the fourth possible seed position, SeedPosition(4), is set to the centroid position from the matching entry.

The second portion of the pseudo code, illustrated in FIG. 36B, governs in the case where the subscriber station is in service. A check is first made to determine in the country associated with SIDserving is different from the country associated with SIDlatest, indicating that the subscriber station crossed a SID boundary during a long traffic call. In this case, the position uncertainty for the centroid location associated with SIDlatest, which is the coverage radius for SIDlatest, is aged to current time. TimeDelta, the difference in time between current time and the time tagged to SIDlatest, is multiplied by seedpos_MsSpeedMax, the assumed velocity of the subscriber station (discussed earlier), and the result added to the coverage radius for the latest SID, RadiusCountryLatest. The result is then compared with the SIDServing country radius. SeedUncertainty(4) is set to whichever of these two values is less. SeedPosition(4) is then set to either the centroid location associated with SIDlatest or that associated with SIDserving. If the aged SIDlatest country radius is less than the SIDserving country radius, then SeedPosition(4) is set to the centroid location for SIDlatest; otherwise, it is set the centroid location for SIDserving.

To explain this further, consider an example where a subscriber station located in Korea crosses the border into China during a call, and the elapsed time is such that the aged country radius of Korea (SIDlatest) is less than the country radius of China (SIDserving). In this example, SeedUncertainty(4) would be set to the aged country radius of Korea, and SeedPosition(4) would be set to the centroid location of Korea.

If the countries associated with SIDserving and SIDlatest are the same, but a matching entry in SID Self Learning Database 2608 associated with SIDserving indicates a conflict, SeedUncertainty(4) is set to the default whole earth uncertainty value, and SeedPosition(4) is set to the default 0 lat/0 lon position. If the counties are the same, but no conflict associated with SIDserving is indicated, then the position uncertainty for the centroid location associated with SIDserving is aged to current time. To accomplish that, TimeDelta, the difference in time between current time and the time tagged to SIDserving, is multiplied by seedpos_MsSpeedMax, the assumed velocity of the subscriber station (discussed earlier), and the result added to the coverage radius for the serving SID. The result is then compared with the default whole earth position uncertainty value. SeedUncertainty(4) is set to whichever of these two values is less. SeedPosition(5) is set to either the centroid location associated with SIDserving.

Fifth, SeedUncertainty(5) is set to the default whole earth value, and SeedPosition(5) is set to the default 0 lat/0 lon value.

At the conclusion of these five stages, the seed position of the subscriber station is then set to whichever of the five possible values, SeedPosition(i), 1≦i≦5, has the lowest corresponding SeedUncetainty(i), 1≦i≦5.

The PE then derives acquisition assistance information for the selected seed position and position uncertainty, and passes this information on to the GPS Searcher. If the GPS Searcher fails to produce a valid GPS fix, and the seed position that was obtained previously was generated from the SID Self Learning Database 2606 or SID Country Table Database 2608 options, the PE regenerates the acquisition assistance information using the seed position as the default 0 lat/0 lon value and the position uncertainty as the default whole earth value. It then provides this information to the GPS Searcher, thus initiating another GPS fix attempt.

While various embodiments, implementations and examples have been described, it will be apparent to those of ordinary skill in the art that many more embodiments, implementations and examples are possible that are within the scope of this invention. Consequently, the invention is not to be limited except in relation to the appended claims. 

1. In a subscriber station in a wireless communication system, a method of updating a data structure having a plurality of entries associating possible values of at least one parameter obtainable from at least one overhead message communicated by a wireless communications system, with corresponding positions, the method comprising: receiving an overhead message from the wireless communications system indicating that an update condition is present; and updating the data structure responsive to information from a central server accessible by the subscriber station.
 2. The method of claim 1, wherein the information is an allocation of possible System Identifier (SID) values.
 3. The method of claim 1, wherein the information is an allocation of ranges to countries.
 4. The method of claim 1, wherein the information is an allocation of geographical regions.
 5. The method of claim 1, wherein the information includes an identification of known conflicts in the use of System Identifier (SID) values.
 6. A method of updating a data structure in memory of a subscriber station in a wireless communication system, the data structure having a plurality of entries, each entry comprising a stored position associated with a value of a parameter obtainable from overhead messages, the method comprising: operating in an unassisted position location mode; initializing an entry in the data structure; and obtaining a value of a parameter from an overhead message; determining the entry exists in the data structure based on the obtained value; accessing the entry to obtain a seed position; and determining, using the seed position, a position from signals from a satellite position system.
 7. The method of claim 6, wherein the act of initialing comprises: determining an initial position from signals from the satellite position system; obtaining the value of the parameter from an initial overhead message; and storing to the entry, based on the obtained value, the determined initial position as the stored position.
 8. The method of claim 6, wherein the act of initialing comprises obtaining a SID country table containing entries from a server containing IFAST data, wherein the IFAST data comprises, for each of a plurality of the entries, a centroid location and a coverage radius associated with a country.
 9. The method of claim 6, wherein the act of initialing comprises setting an initial seed position based on the subscriber station's national registration, the act of setting comprising: determining the subscriber station's national registration; determining the initial seed position based on the subscriber station's national registration; determining, using the initial seed position, an initial position from signals from the satellite position system; and storing to the entry the determined initial position as the stored position.
 10. The method of claim 6, wherein the act of initialing comprises assigning a hash value to each of the plurality of the entries to define a priority.
 11. The method of claim 6, wherein each of the plurality of entries further comprises an uncertainty of the stored position.
 12. The method of claim 11, wherein the uncertainty comprises a parameter from the overhead message, wherein the parameter is a maximum antenna range (MAR).
 13. The method of claim 6, wherein each of the plurality of entries further comprises an uncertainty of the stored position, the method further comprising updating the entry with a position of lower uncertainty, the act of updating comprising: determining an uncertainty value of the determined position; determining the uncertainty value of the determined position is less than the uncertainty of the stored position; and replacing, in the entry, the stored position with the determined position and the uncertainty with the uncertainty value of the determined position.
 14. The method of claim 6, further comprising: determining a SID conflict exists; and updating the data structure to reflect existence of the SID conflict.
 15. The method of claim 6, wherein the act of accessing the entry to obtain the seed position comprises: determining a conflict exist between two entries in the lookup table having a common value equal to the obtained value; and selecting a stored position, from one of the two entries based on a flag indicating relative probability.
 16. The method of claim 6, wherein the parameter comprises a mobile country code (MCC).
 17. The method of claim 16, wherein the parameter further comprises a mobile network code (MNC).
 18. The method of claim 16, wherein the parameter further comprises a location area code (LAC).
 19. The method of claim 16, wherein the parameter further comprises a routing area code (RAC).
 20. The method of claim 16, wherein the parameter further comprises a cell identity (CI).
 21. The method of claim 6, wherein the parameter comprises at least two of a mobile country code (MCC), a mobile network code (MNC), a location area code (LAC), a routing area code (RAC), a cell identity (CI), and a time zone.
 22. The method of claim 6, wherein the wireless communication system comprises a UMTS wireless communication system.
 23. The method of claim 6, wherein the satellite position system comprises a GPS system.
 24. A subscriber station for updating a data structure in memory, the data structure having a plurality of entries, each entry comprising a stored position associated with a value of a parameter obtainable from overhead messages, the subscriber station comprising: means for operating in an unassisted position location mode; means for initializing an entry in the data structure; and means for obtaining a value of a parameter from an overhead message; means for determining the entry exists in the data structure based on the obtained value; means for accessing the entry to obtain a seed position; and means for determining, using the seed position, a position from signals from a satellite position system.
 25. The subscriber station of claim 24, wherein the means for accessing the entry to obtain the seed position comprises: means for determining a conflict exist between two entries in the lookup table having a common value equal to the obtained value; and means for selecting a stored position, from one of the two entries based on a flag indicating relative probability.
 26. A subscriber station for updating a data structure in memory, the data structure having a plurality of entries, each entry comprising a stored position associated with a value of a parameter obtainable from overhead messages, the subscriber station comprising: a processor; and memory, coupled to the processor, comprising code to operate in an unassisted position location mode; code to initialize an entry in the data structure; and code to obtain a value of a parameter from an overhead message; code to determine the entry exists in the data structure based on the obtained value; code to access the entry to obtain a seed position; and code to determine, using the seed position, a position from signals from a satellite position system.
 27. A computer-readable product comprising a computer-readable medium comprising: code for causing at least one computer to operate in an unassisted position location mode; code for causing at least one computer to initialize an entry in the data structure; and code for causing at least one computer to obtain a value of a parameter from an overhead message; code for causing at least one computer to determine the entry exists in the data structure based on the obtained value; code for causing at least one computer to access the entry to obtain a seed position; and code for causing at least one computer to determine, using the seed position, a position from signals from a satellite position system. 